An Approximate Analysis of a Bufferless N x N Synchronous Clos ATM Switch

We consider a synchronized bufferless Clos ATM switch with input cell processor queues. The arrival process to each input port of the switch is assumed to be bursty and it is modeled by an Interrupted Bernoulli Process. Each cell processor queue is modeled as an IBP /Geo/l/K queue. We present an exact analysis of the IBP /Geo/l queue and IBP /Geo/l/K queue. These results are then used in an approximation algorithm for analyzing this ATM switch. The approximation algorithm was validated by carrying out extensive comparisons against simulation data. The approximate results have a better error when the squared coefficient of variation of the arrival process increases.